An upper and lower bound for clock synchronization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Upper and Lower Bound for Clock Synchronization

The problem of synchronizing clocks of processes in a fully connected network is considered. It is proved that, even if the clocks all run at the same rate as real time and there are no failures, an uncertainty of e in the message delivery time makes it impossible to synchronize the clocks of n processes any more closely than e(1 1/n). A simple algorithm is given that achieves this bound. © 198...

متن کامل

Lower Bounds for Function Based Clock Synchronization

We assume that each process has access to a local hardware clock and that the drift of correct hardware clocks is bounded by a given constant . Since we are in this paper only interested in internal clock synchronization algorithms capable of masking arbitrary failures, when we talk about a synchronization algorithm, we mean an internal clock synchronization algorithm tolerant of arbitrary fail...

متن کامل

Optimal Clock Synchronization Revisited: Upper and Lower Bounds in Real-Time Systems

This paper1 introduces a simple real-time distributed computing model for message-passing systems, which reconciles the distributed computing and the real-time systems perspective: By just replacing instantaneous computing steps with computing steps of non-zero duration, we obtain a model that both facilitates real-time scheduling analysis and retains compatibility with classic distributed comp...

متن کامل

Some Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2

The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Control

سال: 1984

ISSN: 0019-9958

DOI: 10.1016/s0019-9958(84)80033-9